Approximate range searching in higher dimension
نویسندگان
چکیده
منابع مشابه
Approximate range searching in higher dimension
Applying standard dimensionality reduction techniques, we show how to perform approximate range searching in higher dimension while avoiding the curse of dimensionality. Given points in a unit ball in , an approximate halfspace range query counts (or reports) the points in a query halfspace; the qualifier “approximate” indicates that points within distance of the boundary of the halfspace might...
متن کاملApproximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, such that the range-searching efficiency remains almost the same. We apply this technique to obtain a BSP tree of size O(n log n) such that ε-approximate range searching queries with any constant-complexity convex quer...
متن کاملEfficient Spatial Indexes for Approximate Range Searching
Building efficient spatial indexes for range searching is a central problem in spatial databases. The R-tree has been a popular spatial index thanks to its simplicity, ability to answer various queries, and the flexibility to store spatial objects of different shapes. However, the R-tree is known to be a heuristic-based structure and no guarantees can be made on its query performance. In this p...
متن کاملApproximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε > 0 is provided. Most prior work on this problem has focused on the case of relative errors, where each range shape R is bounded, and points within distance ε · diam(R) of the range’s boundary may or may not be included. W...
متن کاملApproximate Range Searching In The Absolute Error Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε > 0 is provided, and points that are sufficiently close to the range’s boundary may or may not be included. Most prior work on approximating this problem has focused on the case of relative errors, in which it is assumed t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2008
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2007.05.008